Useless-Variable Elimination
نویسنده
چکیده
1 Intro In my 1988 SIGPLAN paper “Control-Flow Analysis in Scheme,” I promised to cover several items in more detail in a “forthcoming tech report.” The tech report has yet to happen. Most of the promised items have been covered in other papers (“The Semantics of Scheme Control-Flow Analysis” and “Data-Flow Analysis and Type Recovery in Scheme”). Useless-variable elimination, however, is still described only in the T source code of my analysis system. I am writing this informal note to get an outline of UVE set down on paper. This text will reappear in my dissertation. This note is intended for limited distribution to interested parties who don’t want to wait for the dissertation.
منابع مشابه
Implementation of Constraint Systems for Useless Variable Elimination
Superfluous variables are often produced as the byproducts of program transformations, compilation, and poorly written code. These variables are irrelevant to the computational outcome of their programs. Eliminating them as a means of higherlevel optimization may increase program execution speed. This paper explores an implementation of Wand and Siveroni’s algorithm for useless variable elimina...
متن کاملTECHNICAL REPORT TR99-02 Type-Based Useless Variable Elimination
We show a type-based method for useless variable elimination, i.e., transformation that eliminates variables whose values contribute nothing to the nal outcome of a computation, and prove its correctness. The algorithm is a surprisingly simple extension of the usual type reconstruction algorithm. Our method seems more attractive than Wand and Siveroni's 0CFA-based method in many respects. First...
متن کاملUseless-Code Elimination and Program Slicing for the Pi-Calculus
In this paper, we study program transformations called uselesscode elimination and program slicing in the context of the π-calculus. The aim of useless-code elimination and program slicing is to simplify a program by eliminating useless or unimportant part of the program. We define formal correctness criteria for those transformations, present a type-based transformation method, and prove its c...
متن کاملUseless Code Elimination and Programm Slicing for the Pi-Calculus
In this paper, we study program transformations called uselesscode elimination and program slicing in the context of the π-calculus. The aim of useless-code elimination and program slicing is to simplify a program by eliminating useless or unimportant part of the program. We define formal correctness criteria for those transformations, present a type-based transformation method, and prove its c...
متن کاملAutomatic useless-code elimination for HOT functional programs
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and complete way, by reducing it to the solution of a system of constraints. We also give a useless-code elimination algorithm which is based on a combined use of these type inference systems. The main application of the techni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991